منابع مشابه
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V,E) and present the notion of vertices f -controlled by a subset M ⊆ V . We introduce the generalized maxcontrolled set problem (gmcsp), where gaps and positive weights are associated to each vertex of V . In this case, the objective is find a sandwich graph G in order to maximize the sum of the weights associated to all vertices f -controlled by ...
متن کاملNear-optimal solutions for the generalized max-controlled set problem
In this work we deal with sandwich graphs G=(V,E) and present the notion of vertices f-controlled by a subset MDV . We introduce the generalized max-controlled set problem (GMCSP), where minimum gaps (defined by function f) and positive weights are associated to each vertex of V. In this case, the objective is to find a sandwich graph G in order to maximize the sum of the weights associated to ...
متن کاملThe max quasi-independent set Problem
In this paper, we deal with the problem of finding quasi-independent sets in graphs. This problem is formally defined in three versions, which are shown to be polynomially equivalent. The one that looks most general, namely, f -QIS, consists of, given a graph and a non-decreasing function f , finding a maximum size subset Q of the vertices of the graph, such that the number of edges in the indu...
متن کاملThe mixed dominating set problem is MAX SNP-hard
Given a graph G = (V,E), a mixed dominating set MD of G is defined to be a subset of V ∪ E such that every element in {(V ∪E)\MD} is either adjacent or incident to an element of MD. The mixed dominating set problem is to find a mixed dominating set with minimum cardinality. This problem is NP-hard. In this paper, we prove that this problem is MAX SNP-hard.
متن کاملThe Generalized Stable Set Problem for Perfect Bidirected Graphs
Bidirected graphs are a generalization of undirected graphs. For bidirected graphs, we can consider a problem whichi is a natural extension of the maximum weighted stable set problem for undirected graphs. Here we call this problem the generalized stable set problem. It is well known that the maximum weighted stable set problem is solvable in polynomial time for perfect undirected graphs. Perfe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2008
ISSN: 1571-0653
DOI: 10.1016/j.endm.2008.01.032